Stephen Cook

Results: 75



#Item
11

A NEW RECURSION-THEORETIC CHARACTERIZATION OF THE POLYTIME FUNCTIONS Stephen Bellantoni and Stephen Cook Abstract. We give a recursion-theoretic characterization of FP which describes polynomial time computation independ

Add to Reading List

Source URL: www.cs.utoronto.ca

Language: English - Date: 2002-02-28 13:39:49
    12

    The Complexity of the Comparator Circuit Value Problem Stephen Cook Joint work with Yuval Filmus and Dai Tri Man Lˆe Department of Computer Science University of Toronto

    Add to Reading List

    Source URL: www.cs.utoronto.ca

    Language: English - Date: 2014-08-07 14:28:20
      13

      Theories for Subexponential-size Bounded-depth Frege Proofs Kaveh Ghasemloo and Stephen Cook Department of Computer Science University of Toronto Canada

      Add to Reading List

      Source URL: www.cs.utoronto.ca

      Language: English - Date: 2013-09-08 11:41:52
        14

        JOURNAL OF COMPUTER AND SYSTEM SCIENCES 7, Time Bounded Random Access Machines STEPHEN A . COOK AND ROBERT A . RECKHOW Department of Computer Science, University of Toronto, Toronto, M S S 1A7, Ontario

        Add to Reading List

        Source URL: www.cs.utoronto.ca

        Language: English - Date: 2010-08-22 18:04:17
          15

          Complexity Theory for Operators in Analysis Akitoshi Kawamura Stephen Cook University of Toronto

          Add to Reading List

          Source URL: www.cs.utoronto.ca

          Language: English - Date: 2010-04-07 13:35:05
            16

            The Hardness of Being Private Anil Ada∗ , Arkadev Chattopadhyay† , Stephen Cook† , Lila Fontes† , Michal Kouck´y‡ , Toniann Pitassi† † Department of Computer Science, University of Toronto, Toronto, Canada

            Add to Reading List

            Source URL: www.cs.utoronto.ca

            Language: English - Date: 2012-04-06 11:02:11
              17

              Correction for “Pebbles and Branching Programs for Tree Evaluation”, by Stephen Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, and Rahul Santhanam, ACM ToCT (3,2), 2012. January, 2013 Theorem 5.15 in the above p

              Add to Reading List

              Source URL: www.cs.utoronto.ca

              Language: English - Date: 2013-02-09 14:53:23
                18

                A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm

                Add to Reading List

                Source URL: www.cs.utoronto.ca

                Language: English - Date: 2015-02-17 12:39:22
                  19

                  The Relative Efficiency of Propositional Proof Systems Author(s): Stephen A. Cook and Robert A. Reckhow Source: The Journal of Symbolic Logic, Vol. 44, No. 1 (Mar., 1979), ppPublished by: Association for Symbolic

                  Add to Reading List

                  Source URL: www.cs.toronto.edu

                  Language: English - Date: 2010-02-26 18:08:19
                    20

                    A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm

                    Add to Reading List

                    Source URL: www.cs.toronto.edu

                    Language: English - Date: 2015-02-17 12:39:22
                      UPDATE